منابع مشابه
Simpler Exact Leader Election via Quantum Reduction
The anonymous network model was introduced by Angluin in [STOC ’80, pages 82-93] to understand the fundamental properties of distributed computing by examining how much each party in a network needs to know about its own identity and the identities of other parties. In this model, all parties with the same number of communication links are identical. When studying the model, the problem of elec...
متن کاملRobust Stabilizing Leader Election
In this paper, we mix two well-known approaches of the fault-tolerance: robustness and stabilization. Robustnessis the aptitude of an algorithm to withstand permanent failures such as process crashes. The stabilization is a generaltechnique to design algorithms tolerating transient failures. Using these two approaches, we propose algorithms thattolerate both transient and crash fail...
متن کاملOn Leader Green Election
In Jacquet et al. (2013) Philippe Jacquet, Dimitris Milioris and Paul Mühlethaler introduced a novel energy efficient broadcast leader election algorithm, which they called, in accordance with the popular fashion in those years, a Leader Green Election (LGE). This algorithm was also presented by P. Jacquet at the conference AofA’13. We will use the same model as in Jacquet et al. (2013), namely...
متن کاملStable Leader Election
We introduce the notion of stable leader election and derive several algorithms for this problem. Roughly speaking, a leader election algorithm is stable if it ensures that once a leader is elected, it remains the leader for as long as it does not crash and its links have been behaving well, irrespective of the behavior of other processes and links. In addition to being stable, our leader elect...
متن کاملAnalysis of Leader Election Algorithms
We start with a set of n players. With some probability P (n, k), we kill n−k players; the other ones stay alive, and we repeat with them. What is the distribution of the number Xn of phases (or rounds) before getting only one player? We present a probabilistic analysis of this algorithm under some conditions on the probability distributions P (n, k), including stochastic monotonicity and the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2017
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-017-1528-8